A least-squares implicit RBF-FD closest point method and applications to PDEs on moving surfaces
نویسندگان
چکیده
منابع مشابه
Direct Contouring of Implicit Closest Point Surfaces
Constructing a (signed) distance field and contouring its zero level set are two important steps in many surface reconstruction methods. While most high-quality distance transforms compute the distance to the surface as well as the closest point on it, the contouring step typically uses only the distance and omits the closest point information. Our novel closest point contouring algorithm (CPC)...
متن کاملLeast squares and point-based surfaces: new perspectives and Applications
Surface approximation from unorganized points belongs to the state-of-art of computer graphics. In this work, we present approaches for surface reconstruction that are based on efficient numerical schemes for function approximation from scattered data and on sophisticate data structures. In addition, we develop a relevant surface reconstruction method to model moving interfaces, specifically, i...
متن کاملSurfaces Generated by Moving Least Squares Methods
An analysis of moving least squares (m.l.s.) methods for smoothing and interpolating scattered data is presented. In particular, theorems are proved concerning the smoothness of interpolants and the description of m.l.s. processes as projection methods. Some properties of compositions of the m.l.s. projector, with projectors associated with finiteelement schemes, are also considered. The analys...
متن کاملApproximate Moving Least-Squares Approximation for Time-Dependent PDEs
For multivariate problems with many scattered data locations the use of radial functions has proven to be advantageous. However, using the usual radial basis function approach one needs to solve a large (possibly dense) linear system. In the moving least squares (MLS) method one obtains a best approximation of the given data in a (moving) weighted least-squares sense. The computational burden i...
متن کاملRobust Generalized Total Least Squares Iterative Closest Point Registration
This paper investigates the use of a total least squares approach in a generalization of the iterative closest point (ICP) algorithm for shape registration. A new Generalized Total Least Squares (GTLS) formulation of the minimization process is presented opposed to the traditional Least Squares (LS) technique. Accounting for uncertainty both in the target and in the source models will lead to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2019
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2018.12.031